Signal Recovery with Multistage Tests and without Sparsity Constraints

نویسندگان

چکیده

A signal recovery problem is considered, where the same binary testing posed over multiple, independent data streams. The goal to identify all signals (resp. noises), i.e., streams alternative null) hypothesis correct, subject prescribed bounds on classical or generalized familywise error probabilities of both types. It not required that exact number be a priori known, only upper numbers and noises are assumed instead. decentralized formulation adopted, according which sample size decision for each must based observations from corresponding stream. novel multistage procedure proposed this shown enjoy high-dimensional asymptotic optimality property. Specifically, it achieves optimal, average streams, expected size, uniformly in true signals, as maximum possible go infinity at arbitrary rates, class sequential tests with global control. In contrast, existing literature achieve property under additional sparsity symmetry conditions. These results an analysis fundamental two zero. Moreover, they supported by simulation studies extended problems non-iid composite hypotheses.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sparse signal recovery with unknown signal sparsity

In this paper, we proposed a detection-based orthogonal match pursuit (DOMP) algorithm for compressive sensing. Unlike the conventional greedy algorithm, our proposed algorithm does not rely on the priori knowledge of the signal sparsity, which may not be known for some application, e.g., sparse multipath channel estimation. The DOMP runs binary hypothesis on the residual vector of OMP at each ...

متن کامل

Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints

Vector valued data appearing in concrete applications often possess sparse expansions with respect to a preassigned frame for each vector component individually. Additionally, different components may also exhibit common sparsity patterns. Recently, there were introduced sparsity measures that take into account such joint sparsity patterns, promoting coupling of non-vanishing components. These ...

متن کامل

Note on sparsity in signal recovery and in matrix identification

The standard approach to recover a signal with a sparse representation in D is to design a measurement matrix ΦD ∈ Cm×n which allows the recovery of any f ∈ Σk from the measurement vector ΦDf whenever k is sufficiently small. While a minimal requirement for the recovery of any f ∈ Σk is that the constructed map ΦD : Σ D k −→ C, f 7→ ΦDf is injective, the recent literature on sparse signal recov...

متن کامل

Stable recovery of deep linear networks under sparsity constraints

We study a deep linear network expressed under the form of a matrix factorization problem. It takes as input a matrix X obtained by multiplying K matrices (called factors and corresponding to the action of a layer). Each factor is obtained by applying a fixed linear operator to a vector of parameters satisfying a sparsity constraint. In machine learning, the error between the product of the est...

متن کامل

Exploiting Correlation in Sparse Signal Recovery Problems: Multiple Measurement Vectors, Block Sparsity, and Time-Varying Sparsity

A trend in compressed sensing (CS) is to exploit structure for improved reconstruction performance. In the basic CS model (i.e. the single measurement vector model), exploiting the clustering structure among nonzero elements in the solution vector has drawn much attention, and many algorithms have been proposed such as group Lasso (Yuan & Lin, 2006). However, few algorithms explicitly consider ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2023

ISSN: ['0018-9448', '1557-9654']

DOI: https://doi.org/10.1109/tit.2023.3299874